More on Putnam ’ s Models
نویسنده
چکیده
In 2001, I published a paper which, among other things, criticized the mathematics involved in one version of Hilary Putnam’s notorious model-theoretic argument against realism. Recently, Luca Bellotti has taken issue with several of the arguments in that paper. Here, I want to respond to Bellotti’s objections and to take the opportunity to make a few, somewhat more general remarks concerning the mathematical side of Putnam’s project.
منابع مشابه
Note on a Theorem of Putnam ' Smichael
In a 1981 book, H. Putnam claimed that in a pure relational language without equality, for any model of a relation that was neither empty nor full, there was another model that satisses the same rst order sentences. Ed Keenan observed that this was false for nite models since equality is a deenable predicate in such cases. This note shows that Putnam's claim is true for innnite models, although...
متن کاملPutnam and Constructibility *
I discuss and try to evaluate the argument about constructible sets made by Putnam in “Models and Reality”, and some of the counterarguments directed against it in the literature. I shall conclude that Putnam’s argument, while correct in substance, nevertheless has no direct bearing on the philosophical question of unintended models of set theory. MSC2000: 00A30, 03A05, 03E45.
متن کاملAkihiro Kanamori Putnam ’ s Constructivization Argument
We revisit Putnam’s constructivization argument from his Models and Reality, part of his model-theoretic argument against metaphysical realism. We set out how it was initially put, the commentary and criticisms, and how it can be specifically seen and cast, respecting its underlying logic and in light of Putnam’s contributions to mathematical
متن کاملDavis-Putnam Style Rules for Deciding Property S
Two set systems E , F on an underlying set V will be said to have Property S if there exists a subset σ of V , such that σ ∩ e 6= ∅, for all e ∈ E and f 6⊆ σ, for all f ∈ F (see [8], [9]]). We give rules for deciding Property S, which generalizes the very successful Davis-Putnam rules for deciding satisfiability in propositional logic.
متن کاملAlgorithms and Experiments on Finding Minimal Models
In this paper we consider the problem of finding minimal models of a set of propositional clauses. This problem has many applications: for instance, finding minimal-length plans, minimal diagnosis, and solving many other minimization and maximization problems. We have adapted the Davis-Putnam algorithm (that finds generic models of a set of clauses) in order to find minimal models. Experiments ...
متن کامل